A New Variable Regularized QR Decom- position-Based Recursive Least M-Esti- mate Algorithm—Performance Analysis and Acoustic Applications

نویسندگان

  • S. C. Chan
  • K. M. Tsui
چکیده

This paper proposes a new variable regularized QR decomposition (QRD)-based recursive least M-estimate (VR-QRRLM) adaptive filter and studies its convergence performance and acoustic applications. Firstly, variable regularization is introduced to an efficient QRD-based implementation of the conventional RLM algorithm to reduce its variance and improve the numerical stability. Difference equations describing the convergence behavior of this algorithm in Gaussian inputs and additive contaminated Gaussian noises are derived, from which new expressions for the steady-state excess mean square error (EMSE) are obtained. They suggest that regularization can help to reduce the variance, especially when the input covariance matrix is ill-conditioned due to lacking of excitation, with slightly increased bias. Moreover, the advantage of the M-estimation algorithm over its least squares counterpart is analytically quantified. For white Gaussian inputs, a new formula for selecting the regularization parameter is derived from the MSE analysis, which leads to the proposed VR-QRRLM algorithm. Its application to acoustic path identification and active noise control (ANC) problems is then studied where a new filtered-x (FX) VR-QRRLM ANC algorithm is derived. Moreover, the performance of this new ANC algorithm under impulsive noises and regularization can be characterized by the proposed theoretical analysis. Simulation results show that the VR-QRRLM-based algorithms considerably outperform the traditional algorithms when the input signal level is low or in the presence of impulsive noises and the theoretical predictions are in good agreement with simulation results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate QR-Based Algorithms for Recursive Nonlinear Least Squares Estiamtion

This paper proposes new approximate QR-based algorithms for recursive nonlinear least squares (NLS) estimation. Two QR decomposition-based recursive algorithms are introduced based on the classical Gauss-Newton (GN) and Levenberg-Marquardt (LM) algorithms in nonlinear unconstrained optimization or least squares problems. Instead of using the matrix inversion formula, recursive QR decomposition ...

متن کامل

A New Variable Regularized Transform Domain NLMS Adaptive Filtering Algorithm—Acoustic Applications and Performance Analysis

This paper proposes a new regularized transform domain normalized LMS (R-TDNLMS) algorithm and studies its mean and mean square convergence performances. The proposed algorithm extends the conventional TDNLMS algorithm by imposing a regularization term on the filter coefficients to reduce the variance of estimators due to the lacking of excitation in a certain frequency band or in the presence ...

متن کامل

BOA The Bayesian Optimization Algorithm

In this paper an algorithm based on the concepts of genetic algorithms that uses an estimation of a probability distribution of promising solutions in order to generate new candidate solutions is proposed To esti mate the distribution techniques for model ing multivariate data by Bayesian networks are used The proposed algorithm identi es reproduces and mixes building blocks up to a speci ed or...

متن کامل

A Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms

In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...

متن کامل

Split Recursive Least Squares: Algorithms, Architectures, and Applications

In this paper, a new computationally eecient algorithm for recursive least-squares (RLS) l-tering is presented. The proposed Split RLS algorithm can perform the approximated RLS with O(N) complexity for signals having no special data structure to be exploited, while avoiding the high computational complexity (O(N 2)) required in the conventional RLS algorithms. Our performance analysis shows th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013